MAXIMUM ZAGREB INDICES IN THE CLASS OF k-APEX TREES

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Weighted Harary indices of apex trees and k-apex trees

If G is a connected graph, then HA(G) = ∑ u6=v(deg(u) + deg(v))/d(u, v) is the additively Harary index and HM (G) = ∑ u6=v deg(u) deg(v)/d(u, v) the multiplicatively Harary index of G. G is an apex tree if it contains a vertex x such that G − x is a tree and is a k-apex tree if k is the smallest integer for which there exists a k-set X ⊆ V (G) such that G − X is a tree. Upper and lower bounds o...

متن کامل

Multiplicative Zagreb indices of k-trees

Let G be a graph with vetex set V (G) and edge set E(G). The first generalized multiplicative Zagreb index of G is ∏ 1,c(G) = ∏ v∈V (G) d(v) , for a real number c > 0, and the second multiplicative Zagreb index is ∏ 2(G) = ∏ uv∈E(G) d(u)d(v), where d(u), d(v) are the degrees of the vertices of u, v. The multiplicative Zagreb indices have been the focus of considerable research in computational ...

متن کامل

Sharp bounds of the Zagreb indices of k-trees

A bound on the values of independence polynomials at-1/k for k-degenerate graphs", Discrete Mathematics 2013 (To appear) Estes, Staton, Wei. " A bound on the values of independence polynomials at-1/k for k-degenerate graphs " Discrete Mathematics.

متن کامل

Multiplicative Zagreb Indices of Trees

Let G be a graph with vertex set V (G) and edge set E(G) . The first and second multiplicative Zagreb indices of G are Π1 = ∏ x∈V (G) deg(x) 2 and Π2 = ∏ xy∈E(G) deg(x) deg(y) , respectively, where deg(v) is the degree of the vertex v . Let Tn be the set of trees with n vertices. We determine the elements of Tn , extremal w.r.t. Π1 and Π2 . AMS Mathematics Subject Classification (2000): 05C05, ...

متن کامل

On the Multiplicative Zagreb Indices of Bucket Recursive‎ ‎Trees

‎Bucket recursive trees are an interesting and natural‎ ‎generalization of ordinary recursive trees and have a connection‎ to mathematical chemistry‎. ‎In this paper‎, ‎we give the lower and upper bounds for the moment generating‎ ‎function and moments of the multiplicative Zagreb indices in a‎ ‎randomly chosen bucket recursive tree of size $n$ with maximal bucket size $bgeq1$‎. Also, ‎we consi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Korean Journal of Mathematics

سال: 2015

ISSN: 1976-8605

DOI: 10.11568/kjm.2015.23.3.401